Proving Isomorphism of First-Order Logic Proof Systems in HOL
نویسندگان
چکیده
We prove in HOL that three proof systems for classical rst-order predicate logic, the Hilbertian axiomatization, the system of natural deduction, and a variant of sequent calculus, are isomorphic. The isomorphism is in the sense that provability of a conclusion from hypotheses in one of these proof systems is equivalent to provability of this conclusion from the same hypotheses in the others. Proving isomorphism of these three proof systems allows us to guarantee that meta-logical provability properties about one of them would also hold in relation to the others. We prove the deduction, monotonicity, and compactness theorems for Hilbertian axiomatization, and the substitution theorem for the system of natural deduction. Then we show how these properties can be translated between the proof systems. Besides, by proving a theorem which states that provability in attened sequent calculus implies provability in standard sequent calculus, we show how some meta-logical results about Hilbertian axiomatization and natural deduction can be translated to sequent calculus.
منابع مشابه
A Comparison of MDG and HOL
Interactive formal proof and automated veri cation based on decision graphs are two contrasting formal hardware veri cation techniques. In this paper, we compare these two approaches. In particular we consider HOL and MDG. The former is an interactive theorem proving system based on higher-order logic, while the latter is an automatic system based on Multiway Decision Graphs. As the basis for o...
متن کاملProofs, programs and executable specifications in higher order logic
This thesis presents several extensions to the generic theorem prover Isabelle, a logical framework based on higher order logic. The central contribution of this thesis is the extension of Isabelle with a calculus of primitive proof terms, in which proofs are represented using λ-terms in the spirit of the Curry-Howard isomorphism. Primitive proof terms allow for an independent verification of p...
متن کاملCombining WS1S and HOL
We investigate the combination of the weak second-order monadic logic of one successor (WS1S) with higher-order logic (HOL). We show how these two logics can be combined, how theorem provers based on them can be safely integrated, and how the result can be used. In particular, we present an embedding of the semantics of WS1S in HOL that provides a basis for coupling the MONA system, a decision ...
متن کاملA Comparison of MDG and HOL for Hardware Verification
Interactive formal proof and automated veriication based on decision graphs are two contrasting formal hardware veriication techniques. In this paper, we compare these two approaches. In particular we consider HOL and MDG. The former is an interactive theorem proving system based on higher-order logic, while the latter is an automatic system based on Multiway Decision Graphs. As the basis for o...
متن کاملComparing HOL and MDG: a Case Study on the Verification of an ATM Switch Fabric
Interactive formal proof and automated veriication based on decision graphs are two contrasting formal hardware veriication techniques. In this paper, we compare these two approaches. In particular, we consider HOL and MDG. The former is an interactive theorem-proving system based on higher-order logic, while the latter is an automatic system based on Multiway Decision Graphs. As the basis for ...
متن کامل